#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=200;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n,k;cin>>n>>k;
    if(n%2==0){
        if(k%n==0) cout<<n<<"\n";
        else cout<<(k%n)<<"\n";
    }
    else if(n&1){
        LL mid=(n+1)/2;
        if(k%n==0) cout<<2<<"\n";
        else{
            if(k%n<mid) cout<<(k%n)<<"\n";
            else cout<<(k%n+1)<<"\n";
        }
    }
  }
return 0;
}
